A nowhere-zero point in linear mappings
نویسندگان
چکیده
منابع مشابه
A nowhere-zero point in liner mappings
We s(ate the following conjecture and prove it for the case where q is a proper prime power: Let A be a nonsingular n by n matrix over the finite fieM GF~, q~-4, then there exists a vector x in (GFa) ~ such that both x and ~4x have no zero component. In this note we consider-the following conjecture: Conjecture 1. Let A be a nonsingular n by n matrix over the finite field GFa, q~_4, then there ...
متن کاملOn the Number of Nowhere Zero Points in Linear Mappings
Let A be a nonsingular n by n matrix over the finite field GFq, k = bn2 c, q = p, a ≥ 1, where p is prime. Let P (A, q) denote the number of vectors x in (GFq) such that both x and Ax have no zero component. We prove that for n ≥ 2, and q > 2 ( 2n 3 ) , P (A, q) ≥ [(q − 1)(q − 3)](q − 2)n−2k and describe all matrices A for which the equality holds. We also prove that the result conjectured in [...
متن کاملNowhere-zero flow polynomials
In this article we introduce the flow polynomial of a digraph and use it to study nowherezero flows from a commutative algebraic perspective. Using Hilbert’s Nullstellensatz, we establish a relation between nowhere-zero flows and dual flows. For planar graphs this gives a relation between nowhere-zero flows and flows of their planar duals. It also yields an appealing proof that every bridgeless...
متن کاملNowhere-zero 5-flows
We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. Therefore, a possible minimum counterexample to the 5-flow conjecture has oddness at least 6.
متن کاملExtending a partial nowhere-zero 4-flow
In [J Combin Theory Ser B, 26 (1979), 205–216], Jaeger showed that every graph with 2 edge-disjoint spanning trees admits a nowhere-zero 4-flow. In [J Combin Theory Ser B, 56 (1992), 165–182], Jaeger et al. extended this result by showing that, if A is an abelian group with |A| = 4, then every graph with 2 edgedisjoint spanning trees is A-connected. As graphs with 2 edge-disjoint spanning trees...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1989
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02125351